Gang Scheduling in a Distributed System under Processor Failures and Time-Varying Gang Size
نویسنده
چکیده
In this paper we study the performance of a distributed system which is subject to hardware failures and subsequent repairs. A special type of scheduling called gang scheduling is considered, under which jobs consist of a number of interacting tasks which are scheduled to run simultaneously on distinct processors. System performance is examined and compared in cases where different distributions for the number of parallel tasks per job (gang size) are employed. We examine cases where gang size is defined by a specific distribution and also a case where gang size distribution varies with time.
منابع مشابه
Performance Analysis of Gang Scheduling in a Distributed System under Processor Failures
In this paper we study the performance of a distributed system that is subject to hardware failures and subsequent repairs. A special type of scheduling called gang scheduling is considered, under which jobs consist of a number of interacting tasks which are scheduled to run simultaneously on distinct processors. Two different gang scheduling policies used to schedule parallel jobs are examined...
متن کاملPerformance Analysis of a Distributed System under Time-Varying Workload and Processor Failures
This paper studies the performance of a distributed system which is subject to hardware failures and subsequent repairs. A special type of scheduling called gang scheduling is considered, under which jobs consist of a number of interacting tasks which are scheduled to run simultaneously on distinct processors. The distribution for the number of parallel tasks per job varies with time. Two gang ...
متن کاملParallel Virtual Memory for Time Shared Environments
This paper analyses the issues involved in providing virtual distributed shared memory for time-shared parallel machines. We study the performance of two di erent page management policies, namely, static and dynamic page allocation under two widely accepted scheduling policies: Gang scheduling and independent processor scheduling. The performance of each page management policy is studied under ...
متن کاملPerformance Evaluation of Gang Scheduling for Parallel and Distributed Multiprogramming
In this paper we explore the performance of various aspects of gang scheduling designs. We developed an event-driven simulator of a vanilla gang scheduler that relies on the Distributed Hierarchical Control (DHC) structure. We also developed three variations of the vanilla gang scheduler that rely on a push-down heuristic and on two job-migration schemes to decrease response times by reducing p...
متن کاملStochastic Analysis of Gang Scheduling in Parallel and Distributed Systems
Gang scheduling is an approach for resource allocation in parallel and distributed systems that combines time-sharing with space-sharing to ensure a short response time for interactive tasks and high overall system throughput. In this paper, we present queueing theoretic models for a particular gang scheduling system under a workload representative of large-scale engineering and scientiic compu...
متن کامل